Characterization of full rank ACI-matrices over fields
نویسندگان
چکیده
منابع مشابه
Full-Rank Perfect Codes over Finite Fields
In this paper, we propose a construction of fullrank q-ary 1-perfect codes over finite fields. This construction is a generalization of the Etzion and Vardy construction of fullrank binary 1-perfect codes (1994). Properties of i-components of q-ary Hamming codes are investigated and the construction of full-rank q-ary 1-perfect codes is based on these properties. The switching construction of 1...
متن کاملNUMBER OF RANK r SYMMETRIC MATRICES OVER FINITE FIELDS
We determine the number of n×n symmetric matrices over GF (p) that have rank r for 0 ≤ r ≤ n. In [BM2] Brent and McKay determine the number of n × n symmetric matrices over Zp that have determinant zero. Thus they determine the number of n× n symmetric matrices over Zp that have rank n. We extend their result to symmetric matrices over GF (p) and we determine the number of matrices that have ra...
متن کاملThe rank of sparse random matrices over finite fields
Let M be a random matrix over GFq] such that for each entry M ij in M and for each non-zero eld element the probability PrrM ij = ] is p=(q ? 1), where p = (log n ? c)=n and c is an arbitrary but xed positive constant. The probability for a matrix entry to be zero is 1?p. It is shown that the expected rank of M is n ? O(1): Furthermore, there is a constant A such that the probability that the r...
متن کاملOn Rank Problems for Subspaces of Matrices over Finite Fields
In this thesis we are concerned with themes suggested by rank properties of subspaces of matrices. Historically, most work on these topics has been devoted to matrices over such fields as the real or complex numbers, where geometric or analytic methods may be applied. Such techniques are not obviously applicable to finite fields, and there were very few general theorems relating to rank problem...
متن کاملWeight and Rank of Matrices over Finite Fields
Abstract. Define the weight of a matrix to be the number of non-zero entries. One would like to count m by n matrices over a finite field by their weight and rank. This is equivalent to determining the probability distribution of the weight while conditioning on the rank. The complete answer to this question is far from finished. As a step in that direction this paper finds a closed form for th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2013
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.09.042